Solving a Truck Dispatching Scheduling Problem Using Branch-and-Cut
نویسندگان
چکیده
منابع مشابه
Bixby & Lee/truck Dispatching Scheduling Using Branch-and-cut
1 In this paper we present a branch-and-cut algorithm for a structured 0/1 integer programming problem referred to as the \truck dispatching scheduling (TDS) problem." The TDS problem is a vehicle routing and scheduling problem that arose from an oil company's desire to better utilize regional truck eets and drivers. Many studies on diierent variations of vehicle routing and scheduling have app...
متن کاملBranch-and-Price-and-Cut for the Vehicle Routing and Truck Driver Scheduling Problem
Many governments worldwide have imposed hours of service regulations for truck drivers to ensure that break and rest periods are regularly taken. Transport companies have to take these into account and plan the routes and schedules of their truck drivers simultaneously. This problem is called vehicle routing and truck driver scheduling problem (VRTDSP). With their paper “An exact method for veh...
متن کاملA Branch-and-Cut algorithm for factory crane scheduling problem
The factory crane scheduling problem (FCSP) deals with assigning delivery tasks to cranes and then sequencing them, in order to minimize the total completion time for all tasks. In this paper, delivery tasks for required jobs are preemptive allowed at most once before the jobs arrive at exit. The preemptive jobs are temporarily stored in a buffer stack, in which jobs pickup and delivery should ...
متن کاملSolving a Log-Truck Scheduling Problem with Constraint Programming
Scheduling problems in the forest industry have received significant attention in the recent years and have contributed many challenging applications for optimization technologies. This paper proposes a solution method based on constraint programming and mathematical programming for a log-truck scheduling problem. The problem consists of scheduling the transportation of logs between forest area...
متن کاملSolving the Orienteering Problem through Branch-and-Cut
Bran h-and-Cut Matteo Fis hetti DEI, University of Padova, 35131 Padova, Italy; Email: s h dei.unipd.it Juan Jos e Salazar Gonz alez DEIOC, University of La Laguna, 38271 Tenerife, Spain; Email: jjsalaza ull.es Paolo Toth DEIS, University of Bologna, 40136 Bologna, Italy; Email: ptoth deis.unibo.it Abstra t In the Orienteering Problem (OP) we are given an undire ted graph with edge weights and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research
سال: 1998
ISSN: 0030-364X,1526-5463
DOI: 10.1287/opre.46.3.355